- infinite hypergraphs
- мат.бесконечный гиперграфы
English-Russian scientific dictionary. 2008.
infinite hypergraphs
Смотреть что такое "infinite hypergraphs" в других словарях:
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Ramsey's theorem — This article goes into technical details quite quickly. For a slightly gentler introduction see Ramsey theory. In combinatorics, Ramsey s theorem states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple… … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia
Property B — In mathematics, Property B is a certain set theoretic property. Formally, given a finite set X , a collection C of subsets of X , all of size n , has Property B iff we can partition X into two disjoint subsets Y and Z such that every set in C… … Wikipedia
Lovász local lemma — In probability theory, if a large number of events are all independent of one another, then there is a positive (possibly small) probability that none of the events will occur. The Lovász local lemma (proved in 1975 by László Lovász and Paul… … Wikipedia
Dense graph — In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges. The opposite, a graph with only a few edges, is a sparse graph. The distinction between sparse and dense graphs is rather vague, and… … Wikipedia
Reconstruction conjecture — Informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. It is due to KellyKelly, P. J., [http://projecteuclid.org/getRecord?id=euclid.pjm/1103043674 A congruence theorem for trees] ,… … Wikipedia
Cooperative game — This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ( coalitions )… … Wikipedia
List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… … Wikipedia
Propriete B — Propriété B En mathématiques, dans la théorie des jeux, un ensemble peut posséder la propriété B. Concrètement, en prenant un jeu fini X, une collection C de sous jeux de X de taille n; X possède la propriété B ssi on peut séparer X en deux sous… … Wikipédia en Français
